Surface oscillations in channeled snow flows

An experimental device has been built to measure velocity profiles and friction laws in channeled snow flows. The measurements show that the velocity depends linearly on the vertical position in the flow and that the friction coefficient is a first-order polynomial in velocity (u) and thickness (h) of the flow. In all flows, oscillations on the surface of the flow were observed throughout the channel and measured at the location of the probes. The experimental results are confronted with a shallow water approach. Using a Saint-Venant modeling, we show that the flow is effectively uniform in the streamwise direction at the measurement location. We show that the surface oscillations produced by the Archimedes's screw at the top of the channel persist throughout the whole length of the channel and are the source of the measured oscillations. This last result provides good validation of the description of such channeled snow flows by a Saint-Venant modeling

Relevance of visco-plastic theory in a multi-directional inhomogeneous granular flow

We confront a recent visco-plastic description of dense granular flows [P. Jop et al, Nature, {\bf 441} (2006) 727] with multi-directional inhomogeneous steady flows observed in non-smooth contact dynamics simulations of 2D half-filled rotating drums. Special attention is paid to check separately the two underlying fundamental statements into which the considered theory can be recast, namely (i) a single relation between the invariants of stress and strain rate tensors and (ii) the alignment between these tensors. Interestingly, the first prediction is fairly well verified over more than four decades of small strain rate, from the surface rapid flow to the quasi-static creep phase, where it is usually believed to fail because of jamming. On the other hand, the alignment between stress and strain rate tensors is shown to fail over the whole flow, what yields an apparent violation of the visco-plastic rheology when applied without care. In the quasi-static phase, the particularly large misalignment is conjectured to be related to transient dilatancy effects

Reconfiguring Independent Sets in Claw-Free Graphs

We present a polynomial-time algorithm that, given two independent sets in a claw-free graph $G$, decides whether one can be transformed into the other by a sequence of elementary steps. Each elementary step is to remove a vertex $v$ from the current independent set $S$ and to add a new vertex $w$ (not in $S$) such that the result is again an independent set. We also consider the more restricted model where $v$ and $w$ have to be adjacent

A harsh parenting team? Maternal reports of coparenting and coercive parenting interact in association with children’s disruptive behaviour

Background: Parenting and coparenting are both important for children’s adjustment, but their interaction has been little explored. Using a longitudinal design and considering two children per family, we investigated mothers’ and fathers’ perceptions of coparenting as moderators of associations between their coercive parenting and children’s disruptive behaviour. Methods: Mothers and fathers from 106 ‘intact’ families were included from the Twins, Family and Behaviour study (TFaB). At Time 1 (Mchild age=3 years 11 months, SDchild age=4.44 months) parents reported on their coercive parenting and children’s disruptive behaviour via questionnaire; at Time 2 (Mchild age=4 years 8 months, SDchild age=4.44 months) perceptions of coparenting and the marital relationship were collected by telephone interview. Questionnaire-based reports of children’s disruptive behaviour were collected at follow-up (Mchild age=5 years 11 months, SDchild age=5.52 months). Multilevel modelling was used to examine child-specific and family-wide effects. Results: Conservative multilevel models including both maternal and paternal perceptions demonstrated that maternal perceptions of coparenting and overall coercive parenting interacted in their prediction of parent-reported child disruptive behaviour. Specifically, accounting for perceived marital quality, behavioural stability, and fathers’ perceptions, only in the context of perceived higher quality coparenting was there a positive association between mother-reported overall coercive parenting and children’s disruptive behaviour at follow-up. Conclusions: When combined with highly coercive parenting, maternal perceptions of high quality coparenting may be detrimental for children’s adjustment

Mothers’ and fathers’ perceptions of marital relationships and coparenting twins during school transition

Coparenting and the marital relationship are closely related yet distinct family subsystems hypothesized to influence one another. Little is known about these processes with consideration of more than one child in the family, which may have important implications. Here, we specifically focus on families with young twins, enabling us to account for sibling age-difference confounds, as well as due to the greater parenting demands and higher divorce rates in twin families. Using cross-lagged models for both mothers and fathers, we examined bidirectional associations between coparenting and the marital relationship during children’s transition to formal schooling. Parents of twins from 107 ‘intact’ families reported perceptions of coparenting and the marital relationship via telephone interview at Time 1 (Mchild age = 4years 8 months, SDchild age = 4.44 months) and questionnaire at Time 2 (Mchild age = 6 years, SDchild age = 6.12 months). Accounting for within-time associations and temporal stability for both mothers and fathers, coparenting was positively associated with subsequent reports of the marital relationship; there was no evidence of reciprocal associations between the marital relationship and subsequent coparenting. As children transition to primary school, the quality of coparenting may be a driver of the quality of the marital relationship for parents of twins. Those seeking to improve the marital relationship should pay due attention to perceptions of coparenting

Cleaved surface of i-AlPdMn quasicrystals: Influence of the local temperature elevation at the crack tip on the fracture surface roughness

Roughness of i-AlPdMn cleaved surfaces are presently analysed. From the atomic scale to 2-3 nm, they are shown to exhibit scaling properties hiding the cluster (0.45 nm) aperiodic structure. These properties are quantitatively similar to those observed on various disordered materials, albeit on other ranges of length scales. These properties are interpreted as the signature of damage mechanisms occurring within a 2-3 nm wide zone at the crack tip. The size of this process zone finds its origin in the local temperature elevation at the crack tip. For the very first time, this effect is reported to be responsible for a transition from a perfectly brittle behavior to a nanoductile one.Comment: 8 page

Recognizing Graphs Close to Bipartite Graphs with an Application to Colouring Reconfiguration

We continue research into a well-studied family of problems that ask whether the vertices of a given graph can be partitioned into sets A and B, where A is an independent set and B induces a graph from some specified graph class G. We consider the case where G is the class of k-degenerate graphs. This problem is known to be polynomial-time solvable if k = 0 (recognition of bipartite graphs), but NP-complete if k = 1 (near-bipartite graphs) even for graphs of maximum degree 4. Yang and Yuan [DM, 2006] showed that the k = 1 case is polynomial-time solvable for graphs of maximum degree 3. This also follows from a result of Catlin and Lai [DM, 1995]. We study the general k ≥ 1 case for n-vertex graphs of maximum degree k + 2 We show how to find A and B in O(n) time for k = 1, and in O(n 2 ) time for k ≥ 2. Together, these results provide an algorithmic version of a result of Catlin [JCTB, 1979] and also provide an algorithmic version of a generalization of Brook’s Theorem, proved by Borodin, Kostochka and Toft [DM, 2000] and Matamala [JGT, 2007]. The results also enable us to solve an open problem of Feghali et al. [JGT, 2016]. For a given graph G and positive integer `, the vertex colouring reconfiguration graph of G has as its vertex set the set of `-colourings of G and contains an edge between each pair of colourings that differ on exactly on vertex. We complete the complexity classification of the problem of finding a path in the reconfiguration graph between two given `-colourings of a given graph of maximum degree k

On the diameter of reconfiguration graphs for vertex colourings

The reconfiguration graph of the k-colourings of a graph G contains as its vertex set the proper vertex k-colourings of G, and two colourings are joined by an edge in the reconfiguration graph if they differ in colour on just one vertex of G. We prove that for a graph G on n vertices that is chordal or chordal bipartite, if G is k-colourable, then the reconfiguration graph of its ℓ-colourings, for ℓ⩾k+1, is connected and has diameter O(n2). We show that this bound is asymptotically tight up to a constant factor

Block to granular-like transition in dense bubble flows

We have experimentally investigated 2-dimensional dense bubble flows underneath inclined planes. Velocity profiles and velocity fluctuations have been measured. A broad second-order phase transition between two dynamical regimes is observed as a function of the tilt angle $\theta$. For low $\theta$ values, a block motion is observed. For high $\theta$ values, the velocity profile becomes curved and a shear velocity gradient appears in the flow.Comment: Europhys. Lett. (2003) in pres

Fixed-Parameter Tractability of Token Jumping on Planar Graphs

Suppose that we are given two independent sets $I_0$ and $I_r$ of a graph such that $|I_0| = |I_r|$, and imagine that a token is placed on each vertex in $I_0$. The token jumping problem is to determine whether there exists a sequence of independent sets which transforms $I_0$ into $I_r$ so that each independent set in the sequence results from the previous one by moving exactly one token to another vertex. This problem is known to be PSPACE-complete even for planar graphs of maximum degree three, and W[1]-hard for general graphs when parameterized by the number of tokens. In this paper, we present a fixed-parameter algorithm for the token jumping problem on planar graphs, where the parameter is only the number of tokens. Furthermore, the algorithm can be modified so that it finds a shortest sequence for a yes-instance. The same scheme of the algorithms can be applied to a wider class of graphs, $K_{3,t}$-free graphs for any fixed integer $t \ge 3$, and it yields fixed-parameter algorithms